Termination Proof Script

Consider the TRS R consisting of the rewrite rules
1:    c  → f
2:    f  → g
There is one dependency pair:
3:    C  → F
The approximated dependency graph contains no SCCs and hence the TRS is trivially terminating.
Tyrolean Termination Tool  (0.00 seconds)   ---  May 4, 2006